0.02/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.11	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.10/0.32	% Computer : n010.cluster.edu
0.10/0.32	% Model    : x86_64 x86_64
0.10/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory   : 8042.1875MB
0.10/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1920
0.10/0.32	% WCLimit    : 240
0.10/0.32	% DateTime   : Wed Jul 30 09:44:04 EDT 2025
0.10/0.32	% CPUTime    : 
0.16/0.44	Running higher-order theorem proving
0.16/0.46	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p
1.20/0.66	# Version: 3.0.0-ho
1.20/0.66	# Preprocessing class: HSLMSMSSLLLCHSA.
1.20/0.66	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
1.20/0.66	# Starting lpo1_fix with 720s (3) cores
1.20/0.66	# Starting full_lambda_9 with 240s (1) cores
1.20/0.66	# Starting almost_fo_4 with 240s (1) cores
1.20/0.66	# Starting new_ho_9 with 240s (1) cores
1.20/0.66	# Starting pre_casc_4 with 240s (1) cores
1.20/0.66	# Starting ho_unfolding_6 with 240s (1) cores
1.20/0.66	# ho_unfolding_6 with pid 26533 completed with status 0
1.20/0.66	# Result found by ho_unfolding_6
1.20/0.66	# Preprocessing class: HSLMSMSSLLLCHSA.
1.20/0.66	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
1.20/0.66	# Starting lpo1_fix with 720s (3) cores
1.20/0.66	# Starting full_lambda_9 with 240s (1) cores
1.20/0.66	# Starting almost_fo_4 with 240s (1) cores
1.20/0.66	# Starting new_ho_9 with 240s (1) cores
1.20/0.66	# Starting pre_casc_4 with 240s (1) cores
1.20/0.66	# Starting ho_unfolding_6 with 240s (1) cores
1.20/0.66	# No SInE strategy applied
1.20/0.66	# Search class: HGHSM-FSLM32-DHSMMSBN
1.20/0.66	# partial match(1): HGHSM-FSLM32-MHSMMSBN
1.20/0.66	# Scheduled 11 strats onto 1 cores with 240 seconds (240 total)
1.20/0.66	# Starting full_lambda_5 with 22s (1) cores
1.20/0.66	# full_lambda_5 with pid 26538 completed with status 0
1.20/0.66	# Result found by full_lambda_5
1.20/0.66	# Preprocessing class: HSLMSMSSLLLCHSA.
1.20/0.66	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
1.20/0.66	# Starting lpo1_fix with 720s (3) cores
1.20/0.66	# Starting full_lambda_9 with 240s (1) cores
1.20/0.66	# Starting almost_fo_4 with 240s (1) cores
1.20/0.66	# Starting new_ho_9 with 240s (1) cores
1.20/0.66	# Starting pre_casc_4 with 240s (1) cores
1.20/0.66	# Starting ho_unfolding_6 with 240s (1) cores
1.20/0.66	# No SInE strategy applied
1.20/0.66	# Search class: HGHSM-FSLM32-DHSMMSBN
1.20/0.66	# partial match(1): HGHSM-FSLM32-MHSMMSBN
1.20/0.66	# Scheduled 11 strats onto 1 cores with 240 seconds (240 total)
1.20/0.66	# Starting full_lambda_5 with 22s (1) cores
1.20/0.66	# Preprocessing time       : 0.008 s
1.20/0.66	# Presaturation interreduction done
1.20/0.66	
1.20/0.66	# Proof found!
1.20/0.66	# SZS status Theorem
1.20/0.66	# SZS output start CNFRefutation
1.20/0.66	thf(decl_23, type, is_of: $i > ($i > $o) > $o).
1.20/0.66	thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o).
1.20/0.66	thf(decl_26, type, in: $i > $i > $o).
1.20/0.66	thf(decl_62, type, imp: $o > $o > $o).
1.20/0.66	thf(decl_63, type, d_not: $o > $o).
1.20/0.66	thf(decl_72, type, non: $i > ($i > $o) > $i > $o).
1.20/0.66	thf(decl_73, type, l_some: $i > ($i > $o) > $o).
1.20/0.66	thf(decl_78, type, e_is: $i > $i > $i > $o).
1.20/0.66	thf(decl_124, type, nat: $i).
1.20/0.66	thf(decl_125, type, n_is: $i > $i > $o).
1.20/0.66	thf(decl_128, type, n_some: ($i > $o) > $o).
1.20/0.66	thf(decl_143, type, n_pl: $i > $i > $i).
1.20/0.66	thf(decl_148, type, diffprop: $i > $i > $i > $o).
1.20/0.66	thf(decl_149, type, d_29_ii: $i > $i > $o).
1.20/0.66	thf(decl_213, type, esk56_0: $i).
1.20/0.66	thf(decl_214, type, esk57_0: $i).
1.20/0.66	thf(decl_215, type, esk58_0: $i).
1.20/0.66	thf(decl_216, type, esk59_0: $i).
1.20/0.66	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_d_not)).
1.20/0.66	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_imp)).
1.20/0.66	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_all_of)).
1.20/0.66	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_is_of)).
1.20/0.66	thf(def_non, axiom, ((non)=(^[X1:$i, X2:$i > $o, X4:$i]:((d_not @ ((X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_non)).
1.20/0.66	thf(def_l_some, axiom, ((l_some)=(^[X1:$i, X2:$i > $o]:((d_not @ ((all_of @ (^[X4:$i]:((in @ X4 @ X1))) @ (non @ X1 @ X2))))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_l_some)).
1.20/0.66	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_e_is)).
1.20/0.66	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_diffprop)).
1.20/0.66	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_n_is)).
1.20/0.66	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_d_29_ii)).
1.20/0.66	thf(def_n_some, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X441:$i]:(((((in @ X441 @ nat)))=>((((((Z0 @ X441)))=>(~($true))))))))))=>(~($true))))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', def_n_some)).
1.20/0.66	thf(satz19a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X243:$i]:((in @ X243 @ nat))) @ (^[X244:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((d_29_ii @ X1 @ X244)=>(d_29_ii @ (n_pl @ X1 @ X4) @ (n_pl @ X244 @ X4)))))))))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', satz19a)).
1.20/0.66	thf(satz5, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X214:$i]:((in @ X214 @ nat))) @ (^[X215:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((n_is @ (n_pl @ (n_pl @ X1 @ X215) @ X4) @ (n_pl @ X1 @ (n_pl @ X215 @ X4)))))))))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', satz5)).
1.20/0.66	thf(satz6, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X259:$i]:((in @ X259 @ nat))) @ (^[X260:$i]:((n_is @ (n_pl @ X1 @ X260) @ (n_pl @ X260 @ X1)))))))), file('/export/starexec/sandbox2/tmp/tmp.Udbh7rZdg3/E---3.1_26450.p', satz6)).
1.20/0.66	thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
1.20/0.66	thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
1.20/0.66	thf(c_0_16, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
1.20/0.66	thf(c_0_17, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
1.20/0.66	thf(c_0_18, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_non])).
1.20/0.66	thf(c_0_19, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])).
1.20/0.66	thf(c_0_20, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X414:$i]:(((((in @ X414 @ Z0)))=>((((((Z1 @ X414)))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_l_some])).
1.20/0.66	thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])).
1.20/0.66	thf(c_0_22, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_19])).
1.20/0.66	thf(c_0_23, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
1.20/0.66	thf(c_0_24, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X414:$i]:(((((in @ X414 @ Z0)))=>((((((Z1 @ X414)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_19]), c_0_22])).
1.20/0.66	thf(c_0_25, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
1.20/0.66	thf(c_0_26, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_23])).
1.20/0.66	thf(c_0_27, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X452:$i]:(((((in @ X452 @ nat)))=>(((((((((Z0)=(n_pl @ Z1 @ X452))))))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
1.20/0.66	thf(c_0_28, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X441:$i]:(((((in @ X441 @ nat)))=>((((((Z0 @ X441)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[def_n_some, c_0_24])).
1.20/0.66	thf(c_0_29, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_25, c_0_26])).
1.20/0.66	thf(c_0_30, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X452:$i]:(((((in @ X452 @ nat)))=>(((((((((Z0)=(n_pl @ Z1 @ X452))))))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27, c_0_28]), c_0_29])).
1.20/0.66	thf(c_0_31, negated_conjecture, ~(![X666:$i]:(((in @ X666 @ nat)=>![X665:$i]:(((in @ X665 @ nat)=>![X664:$i]:(((in @ X664 @ nat)=>((![X662:$i]:(((in @ X662 @ nat)=>(((X666)=(n_pl @ X665 @ X662))=>~($true))))=>~($true))=>(![X663:$i]:(((in @ X663 @ nat)=>(((n_pl @ X666 @ X664)=(n_pl @ (n_pl @ X665 @ X664) @ X663))=>~($true))))=>~($true)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19a])]), c_0_21]), c_0_30])).
1.20/0.66	thf(c_0_32, negated_conjecture, ![X1065:$i]:(((in @ esk56_0 @ nat)&((in @ esk57_0 @ nat)&((in @ esk58_0 @ nat)&((((in @ esk59_0 @ nat)|~($true))&((((esk56_0)=(n_pl @ esk57_0 @ esk59_0))|~($true))&(($true)|~($true))))&((~(in @ X1065 @ nat)|(((n_pl @ esk56_0 @ esk58_0)!=(n_pl @ (n_pl @ esk57_0 @ esk58_0) @ X1065))|~($true)))&($true))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])])])).
1.20/0.66	thf(c_0_33, plain, ![X602:$i]:(((in @ X602 @ nat)=>![X601:$i]:(((in @ X601 @ nat)=>![X600:$i]:(((in @ X600 @ nat)=>((n_pl @ (n_pl @ X602 @ X601) @ X600)=(n_pl @ X602 @ (n_pl @ X601 @ X600))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]), c_0_21]), c_0_26])).
1.20/0.66	thf(c_0_34, negated_conjecture, ![X1:$i]:((~((in @ X1 @ nat))|((n_pl @ esk56_0 @ esk58_0)!=(n_pl @ (n_pl @ esk57_0 @ esk58_0) @ X1))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_32])).
1.20/0.66	thf(c_0_35, plain, ![X997:$i, X998:$i, X999:$i]:((~(in @ X997 @ nat)|(~(in @ X998 @ nat)|(~(in @ X999 @ nat)|((n_pl @ (n_pl @ X997 @ X998) @ X999)=(n_pl @ X997 @ (n_pl @ X998 @ X999))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])])).
1.20/0.66	thf(c_0_36, plain, ![X694:$i]:(((in @ X694 @ nat)=>![X693:$i]:(((in @ X693 @ nat)=>((n_pl @ X694 @ X693)=(n_pl @ X693 @ X694)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]), c_0_21]), c_0_26])).
1.20/0.66	thf(c_0_37, negated_conjecture, ![X1:$i]:((((n_pl @ esk56_0 @ esk58_0)!=(n_pl @ (n_pl @ esk57_0 @ esk58_0) @ X1))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[c_0_34])).
1.20/0.66	thf(c_0_38, plain, ![X1:$i, X4:$i, X5:$i]:((((n_pl @ (n_pl @ X1 @ X4) @ X5)=(n_pl @ X1 @ (n_pl @ X4 @ X5)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_35])).
1.20/0.66	thf(c_0_39, negated_conjecture, (in @ esk58_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])).
1.20/0.66	thf(c_0_40, negated_conjecture, (in @ esk57_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])).
1.20/0.66	thf(c_0_41, plain, ![X1092:$i, X1093:$i]:((~(in @ X1092 @ nat)|(~(in @ X1093 @ nat)|((n_pl @ X1092 @ X1093)=(n_pl @ X1093 @ X1092))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])])).
1.20/0.66	thf(c_0_42, negated_conjecture, (((esk56_0)=(n_pl @ esk57_0 @ esk59_0))|~(($true))), inference(split_conjunct,[status(thm)],[c_0_32])).
1.20/0.66	thf(c_0_43, negated_conjecture, ((in @ esk59_0 @ nat)|~(($true))), inference(split_conjunct,[status(thm)],[c_0_32])).
1.20/0.66	thf(c_0_44, negated_conjecture, ![X1:$i]:((((n_pl @ esk57_0 @ (n_pl @ esk58_0 @ X1))!=(n_pl @ esk56_0 @ esk58_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39]), c_0_40])])).
1.20/0.66	thf(c_0_45, plain, ![X1:$i, X4:$i]:((((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_41])).
1.20/0.66	thf(c_0_46, negated_conjecture, ((esk56_0)=(n_pl @ esk57_0 @ esk59_0)), inference(cn,[status(thm)],[c_0_42])).
1.20/0.66	thf(c_0_47, negated_conjecture, (in @ esk59_0 @ nat), inference(cn,[status(thm)],[c_0_43])).
1.20/0.66	thf(c_0_48, negated_conjecture, ![X1:$i]:((((n_pl @ esk57_0 @ (n_pl @ X1 @ esk58_0))!=(n_pl @ esk56_0 @ esk58_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_39])])).
1.20/0.66	thf(c_0_49, negated_conjecture, ![X1:$i]:((((n_pl @ esk57_0 @ (n_pl @ esk59_0 @ X1))=(n_pl @ esk56_0 @ X1))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_46]), c_0_47]), c_0_40])])).
1.20/0.66	thf(c_0_50, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_47]), c_0_39])]), ['proof']).
1.20/0.66	# SZS output end CNFRefutation
1.20/0.66	# Parsed axioms                        : 369
1.20/0.66	# Removed by relevancy pruning/SinE    : 0
1.20/0.66	# Initial clauses                      : 783
1.20/0.66	# Removed in clause preprocessing      : 472
1.20/0.66	# Initial clauses in saturation        : 311
1.20/0.66	# Processed clauses                    : 641
1.20/0.66	# ...of these trivial                  : 6
1.20/0.66	# ...subsumed                          : 66
1.20/0.66	# ...remaining for further processing  : 569
1.20/0.66	# Other redundant clauses eliminated   : 88
1.20/0.66	# Clauses deleted for lack of memory   : 0
1.20/0.66	# Backward-subsumed                    : 10
1.20/0.66	# Backward-rewritten                   : 3
1.20/0.66	# Generated clauses                    : 1817
1.20/0.66	# ...of the previous two non-redundant : 1756
1.20/0.66	# ...aggressively subsumed             : 0
1.20/0.66	# Contextual simplify-reflections      : 13
1.20/0.66	# Paramodulations                      : 1641
1.20/0.66	# Factorizations                       : 2
1.20/0.66	# NegExts                              : 0
1.20/0.66	# Equation resolutions                 : 93
1.20/0.66	# Disequality decompositions           : 0
1.20/0.66	# Total rewrite steps                  : 218
1.20/0.66	# ...of those cached                   : 187
1.20/0.66	# Propositional unsat checks           : 0
1.20/0.66	#    Propositional check models        : 0
1.20/0.66	#    Propositional check unsatisfiable : 0
1.20/0.66	#    Propositional clauses             : 0
1.20/0.66	#    Propositional clauses after purity: 0
1.20/0.66	#    Propositional unsat core size     : 0
1.20/0.66	#    Propositional preprocessing time  : 0.000
1.20/0.66	#    Propositional encoding time       : 0.000
1.20/0.66	#    Propositional solver time         : 0.000
1.20/0.66	#    Success case prop preproc time    : 0.000
1.20/0.66	#    Success case prop encoding time   : 0.000
1.20/0.66	#    Success case prop solver time     : 0.000
1.20/0.66	# Current number of processed clauses  : 228
1.20/0.66	#    Positive orientable unit clauses  : 76
1.20/0.66	#    Positive unorientable unit clauses: 2
1.20/0.66	#    Negative unit clauses             : 13
1.20/0.66	#    Non-unit-clauses                  : 137
1.20/0.66	# Current number of unprocessed clauses: 1681
1.20/0.66	# ...number of literals in the above   : 5756
1.20/0.66	# Current number of archived formulas  : 0
1.20/0.66	# Current number of archived clauses   : 286
1.20/0.66	# Clause-clause subsumption calls (NU) : 24517
1.20/0.66	# Rec. Clause-clause subsumption calls : 3765
1.20/0.66	# Non-unit clause-clause subsumptions  : 72
1.20/0.66	# Unit Clause-clause subsumption calls : 487
1.20/0.66	# Rewrite failures with RHS unbound    : 14
1.20/0.66	# BW rewrite match attempts            : 62
1.20/0.66	# BW rewrite match successes           : 3
1.20/0.66	# Condensation attempts                : 0
1.20/0.66	# Condensation successes               : 0
1.20/0.66	# Termbank termtop insertions          : 133139
1.20/0.66	# Search garbage collected termcells   : 27748
1.20/0.66	
1.20/0.66	# -------------------------------------------------
1.20/0.66	# User time                : 0.155 s
1.20/0.66	# System time              : 0.012 s
1.20/0.66	# Total time               : 0.167 s
1.20/0.66	# Maximum resident set size: 5964 pages
1.20/0.66	
1.20/0.66	# -------------------------------------------------
1.20/0.66	# User time                : 0.161 s
1.20/0.66	# System time              : 0.014 s
1.20/0.66	# Total time               : 0.175 s
1.20/0.66	# Maximum resident set size: 2316 pages
1.20/0.66	% E exiting
1.20/0.66	% E exiting
1.20/0.66	EOF